|
BATON, BAlanced Tree Over-lay Network, is a distributed tree structure for peer-to-peer (P2P) systems. Different from other overlays that use a distributed hash table (DHT), such as in the Chord system, BATON organizes peers in a distributed tree to support range search. In addition, BATON tries to keep the tree in a balanced manner as the AVL tree. And hence, the search cost is bounded by . ==Architecture== BATON is a binary tree. Each node in BATON keeps four kinds of links: # link to its parent node # links to its child nodes # links to its adjacent nodes in in-order # links to the routing nodes in the same level In each tree level, the node is named by its position in the tree. For example, node ''h'' is named 3:0, node ''i'' is named 3:1 and node ''p'' is named 4:6. For a node at position , it will fill its left routing table by nodes at position for any valid and fill its right routing table by nodes at position for any valid . 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「BATON Overlay」の詳細全文を読む スポンサード リンク
|